Analysing partner selection through exchange values

Dynamic and resource-constrained environments raise interesting issues for partnership formation and multi-agent systems. In a scenario in which agents interact with each other to exchange services, if computational resources are limited, agents cannot always accept a request, and may take time to find available partners to delegate their needed services. Several approaches are available to solve this problem, which we explore through an experimental evaluation in this paper. In particular, we provide a computational implementation of Piaget's exchange-values theory, and compare its performance against alternatives

Can Punctured Rate-1/2 Turbo Codes Achieve a Lower Error Floor than their Rate-1/3 Parent Codes?

In this paper we concentrate on rate-1/3 systematic parallel concatenated convolutional codes and their rate-1/2 punctured child codes. Assuming maximum-likelihood decoding over an additive white Gaussian channel, we demonstrate that a rate-1/2 non-systematic child code can exhibit a lower error floor than that of its rate-1/3 parent code, if a particular condition is met. However, assuming iterative decoding, convergence of the non-systematic code towards low bit-error rates is problematic. To alleviate this problem, we propose rate-1/2 partially-systematic codes that can still achieve a lower error floor than that of their rate-1/3 parent codes. Results obtained from extrinsic information transfer charts and simulations support our conclusion.Comment: 5 pages, 7 figures, Proceedings of the 2006 IEEE Information Theory Workshop, Chengdu, China, October 22-26, 200

A Direct Multigrid Poisson Solver for Oct-Tree Adaptive Meshes

We describe a finite-volume method for solving the Poisson equation on oct-tree adaptive meshes using direct solvers for individual mesh blocks. The method is a modified version of the method presented by Huang and Greengard (2000), which works with finite-difference meshes and does not allow for shared boundaries between refined patches. Our algorithm is implemented within the FLASH code framework and makes use of the PARAMESH library, permitting efficient use of parallel computers. We describe the algorithm and present test results that demonstrate its accuracy.Comment: 10 pages, 6 figures, accepted by the Astrophysical Journal; minor revisions in response to referee's comments; added char

Seasonal Nonstationarity and Near-Nonstationarity

This paper presents a detailed discussion of the characteristics of seasonal integrated and near integrated processes, as well as the asymptotic properties of seasonal unit root tests. More specifically, the characteristics of a seasonal random walk and a more general seasonal integrated ARMA process are analysed. Also the implications of modelling nonstationary stochastic season-ality as deterministic are highlighted. A further observation made includes the asymptotic distributions and power functions of several seasonal unit root tests. Dans cet article, nous étudions les propriétés des processsus avec racines unitaires saisonnières et avec racines quasi-unitaires. Nous traitons le cas des marchés aléatoires ainsi que les processus plus généraux et analysons les distributions des estimateurs et les fonctions de puissances de plusieurs tests.Deterministic/stochastic seasonality, seasonal unit roots, Saisonnalité déterministique et stochastique, racines unitaires saisonnières